Embedding Intuitionistic into Classical Logic

Deciding Intuitionistic Propositional Logic via Translation into Classical Logic

W. McCune, ed. 14 International Conference on Automated Deduction (CADE-14), LNAI 1249, pp. 131–145, c ©Springer Verlag, 1997. Abstract. We present a technique that efficiently translates propositional intuitionistic formulas into propositional classical formulas. This technique allows the use of arbitrary classical theorem provers for deciding the intuitionistic validity of a given proposition...

Semantical Observations on the Embedding of Intuitionistic Logic into Intuitionistic Linear Logic

Intuitionistic choice and classical logic

Intuitionistic Logic with Classical Atoms

In this paper, we define a Hilbert-style axiom system IPCCA that conservatively extends intuitionistic propositional logic (IPC) by adding new classical atoms for which the law of excluded middle (LEM) holds. We establish completeness of IPCCA with respect to an appropriate class of Kripke models. We show that IPCCA is a conservative extension of both classical propositional logic (CPC) and als...

Sweet SIXTEEN : Automation via Embedding into Classical Higher-Order Logic

Introduction. Classical logics are based on the bivalence principle, that is, the set of truth-values V has cardinality |V | = 2, usually with V = {T,F} where T and F stand for truthhood and falsity, respectively. Many-valued logics generalize this requirement to more or less arbitrary sets of truth-values, rather referred to as truth-degrees in that context. Popular examples of many-valued log...